Improved Formulations and Computational Strategies for the Solution and Nonconvex Generalized Disjunctive Programs
نویسندگان
چکیده
Many optimization problems require the modelling of discrete and continuous variables, giving rise to mixed-integer linear and mixed-integer nonlinear programming (MILP / MINLP). An alternative representation of MINLP is Generalized Disjunctive Programming (GDP)1. GDP models are represented through continuous and Boolean variables, and involve algebraic equations, disjunctions, and logic propositions. This higher level representation facilitates the modelling process while keeping the logic structure of the problem. GDP models are typically reformulated as MINLP problems to exploit the developments in these solvers. The two traditional GDP-to-MINLP reformulations are the Big-M (BM) and Hull-reformulation (HR). Alternatively to direct MINLP reformulations, special techniques can help to improve the performance in solving GDP problems. There are two main contributions in this thesis. The first contribution involves the development of reformulations and methods that generate improved MINLP models form GDP problems. This development is achieved by exploiting the logic-nature of GDP, as well as alternative GDP-to-MINLP reformulations, to obtain relatively small MINLP models with tight continuous relaxations. The second contribution of this thesis is the improvement of existing GDP solution methods by the use of novel concepts. In particular, we improve the linear disjunctive branch and bound through the use of a Lagrangean relaxation of the HR. Also, we extend the logic-based outer-approximation to nonconvex problems, and develop a novel method to obtain cutting planes that improves the linear relaxation of the nonconvex problem. In the thesis, we first present a new Big-M reformulation of GDPs. Unlike the traditional
منابع مشابه
Using convex nonlinear relaxations in the global optimization of nonconvex generalized disjunctive programs
In this paper we present a framework to generate tight convex relaxations for nonconvex generalized disjunctive programs. The proposed methodology builds on our recent work on bilinear and concave generalized disjunctive programs for which tight linear relaxations can be generated, and extends its application to nonlinear relaxations. This is particularly important for those cases in which the ...
متن کاملStrengthening of lower bounds in the global optimization of Bilinear and Concave Generalized Disjunctive Programs
This paper is concerned with global optimization of Bilinear and Concave Generalized Disjunctive Programs. A major objective is to propose a procedure to find relaxations that yield strong lower bounds. We first present a general framework for obtaining a hierarchy of linear relaxations for nonconvex Generalized Disjunctive Programs (GDP). This framework combines linear relaxation strategies pr...
متن کاملA hierarchy of relaxations for nonlinear convex generalized disjunctive programming
We propose a framework to generate alternative mixed-integer nonlinear programming formulations for disjunctive convex programs that lead to stronger relaxations. We extend the concept of “basic steps” defined for disjunctive linear programs to the nonlinear case. A basic step is an operation that takes a disjunctive set to another with fewer number of conjuncts. We show that the strength of th...
متن کاملReview of Nonlinear Mixed-Integer and Disjunctive Programming Techniques
This paper has as a major objective to present a unified overview and derivation of mixedinteger nonlinear programming (MINLP) techniques, Branch and Bound, Outer-Approximation, Generalized Benders and Extended Cutting Plane methods, as applied to nonlinear discrete optimization problems that are expressed in algebraic form. The solution of MINLP problems with convex functions is presented firs...
متن کاملCutting planes for improved global logic-based outer-approximation for the synthesis of process networks
In this work, we present an improved global logic-based outer approximation method (GLBOA) for the solution of nonconvex generalized disjunctive programs (GDP). The GLBOA allows the solution of nonconvex GDP models, and is particularly useful for optimizing the synthesis of process networks. Two enhancements to the basic GLBOA are presented. The first enhancement seeks to obtain feasible soluti...
متن کامل